Quadratic modulo 2n Cayley graphs
نویسندگان
چکیده
منابع مشابه
On Restricted Unitary Cayley Graphs and Symplectic Transformations Modulo n
We present some observations on a restricted variant of unitary Cayley graphs modulo n, and implications for a decomposition of elements of symplectic operators over the integers modulo n. We define quadratic unitary Cayley graphs Gn, whose vertex set is the ring Zn, and where residues a, b modulo n are adjacent if and only if their difference is a quadratic residue. By bounding the diameter of...
متن کاملEdge Dominating Functions of Quadratic Residue Cayley Graphs
The concept of edge domination is introduced by Mitchell and Hedetniemi [6]. Further results on edge domination are given in Arumugam and Velammal [2]. Functional generalization for vertex subsets has been studied extensively in literature [4, 5]. Cockayne and Mynhardt [3] have introduced that edge subsets may also be embedded into sets of functions and an analogous concept of convexity could a...
متن کاملBasic Minimal Total Dominating Functions of Quadratic Residue Cayley Graphs
Domination theory is an important branch of Graph Theory and has many applications in Engineering, Communication Networks and many others. Allan, R.B., and Laskar, R., [1,2], Cockayne, E.J.,and Hedetniemi, S.T., [3], Haynes, T.W., and Slater, J.S., [4], have studied various domination parameters of graphs. Graphs associated with certain arithmetic functions which are usually called arithmetic g...
متن کاملBasic Edge Dominating Functions of Quadratic Residue Cayley Graphs
Graph Theory has been realized as one of the most useful branches of Mathematics of recent origin, finding widest applications in all most all branches of sciences, social sciences, and engineering and computer science. Nathanson[8] was the pioneer in introducing the concepts of NumberTheory, particularly, the “Theory of congruences” i n Graph Theory, thus paving way for the emergence of a new ...
متن کاملCayley graphs - Cayley nets
It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00229-0